A Novel Matching Formulation for Startup Costs in Unit Commitment
نویسندگان
چکیده
We present a novel formulation for startup cost computation in the unit commitment problem (UC). Both the proposed formulation and existing formulations in the literature are placed in a formal, theoretical dominance hierarchy based on their respective linear programming relaxations. The proposed formulation is tested empirically against existing formulations on large-scale unit commitment instances drawn from realworld data. While requiring more variables than the current state-of-theart formulation, our proposed formulation requires fewer constraints, and is empirically demonstrated to be as tight as a perfect formulation for startup costs. This tightening reduces the computational burden in comparison to existing formulations, especially for UC instances with large variability in net-load due to renewables production.
منابع مشابه
Fast and accurate solution for the SCUC problem in large-scale power systems using adapted binary programing and enhanced dual neural network
This paper presents a novel hybrid method for solving the security constrained unit commitment (SCUC) problem. The proposed formulation requires much less computation time in comparison with other methods while assuring the accuracy of the results. Furthermore, the framework provided here allows including an accurate description of warmth-dependent startup costs, valve point effects, multiple f...
متن کاملTowards Equilibrium Offers in Unit Commitment Auctions with Nonconvex Costs
We compare two types of uniform-price auction formats commonly used in wholesale electricity markets—centrally committed and self-committed markets. Auctions in both markets are conducted by an independent system operator that collects generator bids and determines which generators will operate and how much electricity each will produce. In centrally committed markets, generators submit twopart...
متن کاملA tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
This paper provides the convex hull description for the following basic operating constraints of a single power generation unit in Unit Commitment (UC) problems: 1) generation limits, 2) startup and shutdown capabilities, and 3) minimum up and down times. Although the model does not consider some crucial constraints, such as ramping, the proposed constraints can be used as the core of any UC fo...
متن کاملTight MIP formulations of the power-based unit commitment problem
This paper provides the convex hull description for the basic operation of slowand quick-start units in power-based unit commitment (UC) problems. The basic operating constraints that are modeled for both types of units are (1) generation limits and (2) minimum up and down times. Apart from this, the startup and shutdown processes are also modeled, using (3) startup and shutdown power trajector...
متن کاملPower-Capacity and Ramp-Capability Reserves for Wind Integration in Power-Based UC Published in: IEEE Transactions on Sustainable Energy Special Section on Reserve and Flexibility for Handling Variability and Uncertainty of Renewable Generation
This paper proposes a power-based networkconstrained unit commitment (UC) model as an alternative to the traditional deterministic UCs to deal with wind generation uncertainty. The formulation draws a clear distinction between power-capacity and ramp-capability reserves to deal with wind production uncertainty. These power and ramp requirements can be obtained from wind forecast information. Th...
متن کامل